A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking
نویسندگان
چکیده
Despite of the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that the choice of an appropriate algorithm for a given application is still the most crucial task. The lack of a large database of graphs makes the task of comparing the performance of different graph matching algorithms difficult, and often the selection of an algorithm is made on the basis of a few experimental data available on it. In this paper we describe a database containing 72,800 couples of simple graphs especially devised for comparing the performance of isomorphism and graph-subgraph isomorphism algorithms. The 72,800 couples are split into 18,200 couples of isomorphic graphs and 54,600 couples of graphs with a subgraph isomorphism mapping among them. The graphs include different categories as Randomly Connected Graphs, Regular Meshes (2D, 3D and 4D), Bounded Valence Graphs, Irregular Meshes and Irregular Bounded Valence Graphs. The size of the graphs ranges from few dozens to about 1000 nodes.
منابع مشابه
A Performance Comparison of Five Algorithms for Graph Isomorphism
Despite the significant number of isomorphism algorithms presented in the literature, till now no efforts have been done for characterizing their performance. Consequently, it is not clear how the behavior of those algorithms varies as the type and the size of the graphs to be matched varies in case of real applications. In this paper we present a benchmarking activity for characterizing the pe...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملA Polynomial Time Graph Isomorphism Algorithm For Graphs That Are Not Locally Triangle-Free
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for a restricted class of graphs which are not triangle-free graphs. We consider graphs that have atleast 2 vertices in all rearranged sub-graphs. An Individualization-Refinement procedure(1 Dimensional Weisfeiler-Lehman Method) is used to rearrange one graph which splits the graph into disjoint vertex sets. T...
متن کاملGraph matching: filtering databases of graphs using machine learning techniques
Graphs are a powerful concept useful for various tasks in science and engineering. In applications such as pattern recognition and information retrieval, object similarity is an important issue. If graphs are used for object representation, then the problem of determining the similarity of objects turns into the problem of graph matching. Some of the most common graph matching paradigms include...
متن کامل